Parameter-free polymorphic types
نویسندگان
چکیده
منابع مشابه
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus (“System F”). All quantifications are parameter free. In other words, in every universal type ∀α.τ , the quantified variable α is the only free variable in the scope τ of the quantification. This fragment can be locally proven terminating in a system of intuitionistic second-order arithmetic known to have strength o...
متن کاملExplaining Polymorphic Types
Polymorphic types in programming languages facilitate code reuse, increase reliability and reduce semantic errors in programs. Hindley-Milner type inference forms a strong basis for checking polymorphic types but is less well suited to explaining them, as it introduces intermediate constructs that relate poorly to a programmer's understanding of the program. We report an experiment into expert ...
متن کاملPolymorphic Π1 Types
By polymorphic Π1 types we mean types of the polymorphic lambda calculus (system F) in which Π only occurs positively. For such types the question of inhabitation is decidable and observational equivalence corresponds to βη-equivalence and is representable by a term. Furthermore, in the PER-model based on untyped λ-terms universality holds for all Π1 types (all elements can be typed). At the en...
متن کاملPolymorphic Types in ACL2
This paper describes a tool suite for the ACL2 programming language which incorporates certain ideas from the Hindley-Milner paradigm of functional programming (as exemplified in popular languages like ML and Haskell), including a “typed” style of programming with the ability to define polymorphic types. These ideas are introduced via macros into the language of ACL2, taking advantage of ACL2’s...
متن کاملEncoding Monomorphic and Polymorphic Types
Most automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2008
ISSN: 0168-0072
DOI: 10.1016/j.apal.2008.06.002